A Cell Burst Scheduling for ATM Networking Part I: Theory
نویسندگان
چکیده
Fair queueing is a useful queueing discipline for packet switching systems. It was developed in last decade and was aimed at the general packet switching systems with varying packet length. However, it is not suitable for use in the ATM networking, because the ATM cell length is very small and fixed, and so the scheduling scheme on a per cell basis isn’t practical. Here we introduce the burst and quality unit concepts in the scheduling algorithm and we make some significant modification on the fair queueing and adapt it to ATM networking to meet QoS requirements. Under the WorkConserving assumption, we show that the burst based nonpreemptive and preemptive algorithms provide throughput and fairness guarantees.
منابع مشابه
A Cell Burst Scheduling for ATM Networking Part II: Implementation
The scheduling scheme of a switch affects the delay, throughput and fairness of a network and thus has a great impact on the quality of service (QoS). In Part I, we present a theoretical analysis of a burst scheduling for ATM switches and proved QoS guarantees on throughput and fairness of the applications. Here, we use simulation to demonstrate the superiority of the burst based weighted fair ...
متن کاملCell Delay Variation and Burst Expansion in ATM Networks: Results from a Practical Study Using Fairisle
Current interest in cell delay variation in ATM networks arises from the need to provide guarantees on loss and delay for traac with real time constraints. This study uses the Fairisle ATM LAN to measure the CDV experienced by CBR and periodic, bursty sources when multiplexed with Bernoulli, VBR video and LAN interconnection traac, in a network of non-blocking ATM switches. We nd that higher bi...
متن کاملReal-Time Block Transfer Under a Link-Sharing Hierarchy - Networking, IEEE/ACM Transactions on
Most application data units are too large to be carried in a single packet (or cell) and must be segmented for network delivery. To an application, the end-to-end delays and loss rate of its data units are much more relevant performance measures than ones specified for individual packets (or cells). The concept of a burst (or block) was introduced to represent a sequence of packets (or cells) t...
متن کاملDesign of a Weighted Fair Queueing Cell Scheduler for ATM Networks
Today, ATM networks are being used to carry bursty data traffic with large and highly variable rates, and burst sizes ranging from kilobytes to megabytes. Obtaining good statistical multiplexing performance for this kind of traffic requires much larger buffers than are needed for more predictable applications or for bursty data applications with more limited burst transmission rates. Large buff...
متن کاملSimulation Study of Statistical Delays in an Atm Switch Using Edf Scheduling
In this paper we study statistical delays in an ATM switch using EDF scheduling. In particular , our interests are in the behavior of the tails of cell delay functions and their proximity to their theoretical maximum delay bounds. We observed many factors which contribute to cell delay: source behavior, the degree of multiplexing, and the synchronization of transmissions. We discovered that by ...
متن کامل